Materialized View Selection for Multi-Cube Data Models
نویسندگان
چکیده
OLAP applications use precomputation of aggregate data to improve query response time. While this problem has been well-studied in the recent database literature, to our knowledge all previous work has focussed on the special case in which all aggregates are computed from a single cube (in a star schema, this corresponds to there being a single fact table). This is unfortunate, because many real world applications require aggregates over multiple fact tables. In this paper, we attempt to fill this lack of discussion about the issues arising in multi-cube data models by analyzing these issues. Then we examine performance issues by studying the precomputation problem for multi-cube systems. We show that this problem is significantly more complex than the single cube precomputation problem, and that algorithms and cost models developed for single cube precomputation must be extended to deal well with the multi-cube case. Our results from a prototype implementation show that for multi-cube workloads substantial performance improvements can be realized by using the multi-cube algorithms.
منابع مشابه
View Selection in DW and OLAP: A Theoretical Review
Data Warehousing (DW) systems store materialized views, data marts and data cubes, and provide nicely data exploration and analysis interfaces via OnLine Analytical Processing (OLAP) (Gray et al., 1997) and Data Mining (DM) tools and algorithms. Also, OnLine Analytical Mining (OLAM) (Han, 1997) integrates the previous knowledge discovery methodologies and offers a meaningfully convergence betwe...
متن کاملA Non-Linear Cost Model for Multi-Node OLAP Systems
Answering performance to business queries, mainly of aggregated nature, known as On-Line Analytical Processing queries, depends heavily on the proper selection of multidimensional structures, known as materialized subcubes or views. As user’s queries profiles change, these structures have to be recalibrated, once elected the new appropriated selection through a cube view selection algorithm. In...
متن کاملImplementing Data Cubes Eciently
Decision support applications involve complex queries on very large databases Since response times should be small query optimization is critical Users typically view the data as multi dimensional data cubes Each cell of the data cube is a view consisting of an aggregation of interest like total sales The values of many of these cells are dependent on the values of other cells in the data cube ...
متن کاملSelection of Views to Materialize in
A data warehouse stores materialized views of data from one or more sources, with the purpose of eeciently implementing decision-support or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of materialized views to be maintained at the warehouse. The goal is to select an appropriate set of views that minimizes total query response time and the cost...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000